منابع مشابه
Rumor Spreading on Percolation Graphs
We study the relation between the performance of the randomized rumor spreading (push model) in a d-regular graph G and the performance of the same algorithm in the percolated graph Gp. We show that if the push model successfully broadcast the rumor within T rounds in the graph G then only (1 + ǫ)T rounds are needed to spread the rumor in the graph Gp when T = o (pd).
متن کاملRandomness-Efficient Rumor Spreading
We study the classical rumor spreading problem, which is used to spread information in an unknown network with n nodes. We present the first protocol for any expander graph G with n nodes and minimum degree Θ(n) such that, the protocol informs every node in O(log n) rounds with high probability, and uses O(log n log log n) random bits in total. The runtime of our protocol is tight, and the rand...
متن کاملRandomized Rumor Spreading
We investigate the class of so-called epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose n players communicate in parallel rounds in each of which every player calls a randomly selected communication partner. In every round, players can...
متن کاملRandomized Rumor Spreading Revisited
We develop a simple and generic method to analyze randomized rumor spreading processes in fully connected networks. In contrast to all previous works, which heavily exploit the precise definition of the process under investigation, we only need to understand the probability and the covariance of the events that uninformed nodes become informed. This universality allows us to easily analyze the ...
متن کاملAdaptive Rumor Spreading
Motivated by the recent emergence of the so-called opportunistic communication networks, we consider the issue of adaptivity in the most basic continuous time (asynchronous) rumor spreading process. In our setting a rumor has to be spread to a population; the service provider can push it at any time to any node in the network and has unit cost for doing this. On the other hand, as usual in rumo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems of Computer Science
سال: 2019
ISSN: 2579-2784
DOI: 10.51408/1963-0042